Cellular telephone networks and random maps in hypergraphs
نویسندگان
چکیده
منابع مشابه
Random Walks on Hypergraphs with Applications to Disease-Gene Prioritization
Typically, gene interaction networks are expressed as graphs, storing pairwise interactions between genes. Because of the vast amount of literature on statistical graph inference, this is a useful representation in practice. However, such a pairwise representation ignores more complex features of gene interactions, such as gene regulation and assembly. In this thesis, we propose a hypergraph mo...
متن کاملExtended Discriminative Random Walk: A Hypergraph Approach to Multi-View Multi-Relational Transductive Learning
Transductive inference on graphs has been garnering increasing attention due to the connected nature of many real-life data sources, such as online social media and biological data (protein-protein interaction network, gene networks, etc.). Typically relational information in the data is encoded as edges in a graph but often it is important to model multi-way interactions, such as in collaborat...
متن کاملOnly the source's and sink's neighborhood matters: convergence results for unicast and multicast connections on random graphs and hypergraphs
We study the maximum flow on random weighted directed graphs and hypergraphs, that generalize Erdös-Rényi graphs. We show that, for a single unicast connection chosen at random, its capacity, determined by the max-flow between source and sink, converges in probability to the capacity around the source or sink. Using results from network coding, we generalize this result to different types multi...
متن کاملAssessing the Posture and predicting the factors affecting musculoskeletal disorders in computer uses by neural networks
Introduction: Working with a computer and workplace conditions expose people to risk factors of musculoskeletal disorders (MSDs). This study aimed to assess posture, examine MSDs, and determine, weigh and prioritize the risk factors among computer users by a neural network algorithm. Material and Methods: This descriptive-analytical cross-sectional study was conducted in six phases on compute...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 103 شماره
صفحات -
تاریخ انتشار 2000